A Logic of Finite Syntactic Epistemic States

نویسنده

  • Thomas Ågotnes
چکیده

The thesis presents a logic of the explicit knowledge of deliberative agents who represent their knowledge symbolically as sets of formulae – agents with finite syntactic epistemic states. It is well known that modal epistemic logic either describes implicit knowledge, including all logical consequences of the explicit knowledge, or describes the explicit knowledge of unrealistically intelligent and powerful agents, but does not describe the explicit knowledge of real agents. A source of this problem is the failure to separate the concepts of explicit knowledge and reasoning. The logic in this thesis consists of two parts. The first is a logic of explicit syntactic knowledge, with no closure conditions, which can be viewed as knowledge at a given point in time. Although this is a simple concept, the meta-language is expressive enough to allow the development of an interesting theory of static finite syntactic epistemic states. The second part is a logic of the evolving explicit syntactic knowledge of agents who have reasoning and communication mechanisms in addition to syntactical storage, i.e. about how the epistemic states can change over time as a result of reasoning and/or communication. The language introduces expressions for knowing a rule, analogue to knowing a formula. Instead of the usual closure conditions on knowledge it is possible to express the fact that if an agent knows some formulae and he knows a certain rule, then he may get to know a conclusion if he chooses to. This model is based on Alternating-time Temporal Logic (ATL). It differs from related epistemic logics based on ATL in that it models explicit instead of implicit knowledge and in the expressiveness of rule operators. It differs from related models of evolving explicit knowledge in that it allows reasoning in terms of possible futures, cooperation and strategies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete Axiomatizations of Finite Syntactic Epistemic States

An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this set cannot in general be assumed – reasoning takes time and real agents frequently have contradictory beliefs. This paper discusses a formal model of knowledge as explicitly computed sets of formulae. It is assumed that ...

متن کامل

An Epistemic Logic of Situations

In this paper we present a first order epistemic logic that incorporates the essentially finite character of what is actually known by any knower. Our logic and language allows us to represent familiarity with individuals including individual situations. It is also a logic of l imited awareness in the manner of [FH88]. It is adequate for the syntactic characterization of the shared-si tuat ion ...

متن کامل

Strongly Complete Axiomatizations of "Knowing at Most" in Syntactic Structures

Syntactic structures based on standard syntactic assignments model knowledge directly rather than as truth in all possible worlds as in modal epistemic logic, by assigning arbitrary truth values to atomic epistemic formulae. This approach to epistemic logic is very general and is used in several logical frameworks modeling multi-agent systems, but has no interesting logical properties — partly ...

متن کامل

On the definability of simulation and bisimulation in epistemic logic

We explore when finite epistemic models are definable up to simulation or bisimulation, either over the basic multi-agent epistemic language L or over its extension L with common knowledge operators. Our main results are the following: 1. Bisimulation to finite epistemic states (i.e., pointed models) is not definable in L. 2. Global bisimulation to finite epistemic models is definable using mod...

متن کامل

Strongly Complete Axiomatizations of “Knowing At Most” in Standard Syntactic Assignments

Standard syntactic assignments (SSAs) model knowledge directly rather than as truth in all possible worlds as in modal epistemic logic, by assigning arbitrary truth values to atomic epistemic formulae. It is a very general approach to epistemic logic, but has no interesting logical properties — partly because the standard logical language is too weak to express properties of such structures. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004